翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Computational tree logic ： ウィキペディア英語版 Computation tree logic Computation tree logic (CTL) is a branching-time logic, meaning that its model of time is a tree-like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is realized. It is used in formal verification of software or hardware artifacts, typically by software applications known as model checkers which determine if a given artifact possesses safety or liveness properties. For example, CTL can specify that when some initial condition is satisfied (e.g., all program variables are positive or no cars on a highway straddle two lanes), then all possible executions of a program avoid some undesirable condition (e.g., dividing a number by zero or two cars colliding on a highway). In this example, the safety property could be verified by a model checker that explores all possible transitions out of program states satisfying the initial condition and ensures that all such executions satisfy the property. Computation tree logic is in a class of temporal logics that includes linear temporal logic (LTL). Although there are properties expressible in only one of CTL and LTL, all properties expressible in either logic can also be expressed in CTL *. == Syntax of CTL == The language of well formed formulas for CTL is generated by the following grammar: :$\backslash phi::=\backslash bot\; |\backslash top\; |p|(\backslash neg\backslash phi)|(\backslash phi\backslash and\backslash phi)|(\backslash phi\backslash or\backslash phi)|$ (\phi\Rightarrow\phi)|(\phi\Leftrightarrow\phi)|\mbox\phi|\mbox\phi|\mbox\phi|\mbox\phi|\mbox\phi|\mbox\phi| \mbox(\mbox \phi )|\mbox(\mbox \phi ) where $p$ ranges over a set of atomic formulas. It is not necessary to use all connectives  – for example, $\backslash ,\; \backslash mbox\backslash \}$ comprises a complete set of connectives, and the others can be defined using them. *$\backslash mbox$ means 'along All paths' ''(Inevitably)'' *$\backslash mbox$ means 'along at least (there Exists) one path' ''(possibly)'' For example, the following is a well-formed CTL formula: :$\backslash mbox(\backslash mbox\; p\; \backslash Rightarrow\; \backslash mbox\; r$) The following is not a well-formed CTL formula: :$\backslash mbox\backslash big(r\; \backslash mbox\; q\backslash big)$ The problem with this string is that $U$ can occur only when paired with an $A$ or an $E$. It uses atomic propositions as its building blocks to make statements about the states of a system. CTL then combines these propositions into formulas using logical operators and temporal logics. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Computation tree logic」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.